A network communication through McGee graph and Antimagic labeling
نویسندگان
چکیده
منابع مشابه
New Constructions of Antimagic Graph Labeling
An anti-magic labeling of a finite simple undirected graph with p vertices and q edges is a bijection from the set of edges to the set of integers {1, 2, ..., q} such that the vertex sums are pairwise distinct, where the vertex sum at vertex u is the sum of labels of all edges incident to such vertex. A graph is called anti-magic if it admits an antimagic labeling. Hartsfield and Ringel conject...
متن کاملOn super antimagic total labeling of Harary graph
This paper deals with two types of graph labelings namely, the super (a, d)-edge antimagic total labeling and super (a, d)-vertex antimagic total labeling on the Harary graph C n. We also construct the super edge-antimagic and super vertex-antimagic total labelings for a disjoint union of k identical copies of the Harary graph.
متن کاملAntimagic labeling and canonical decomposition of graphs
An antimagic labeling of a connected graph with m edges is an injective assignment of labels from {1, . . . , m} to the edges such that the sums of incident labels are distinct at distinct vertices. Hartsfield and Ringel conjectured that every connected graph other than K2 has an antimagic labeling. We prove this for the classes of split graphs and graphs decomposable under the canonical decomp...
متن کاملAntimagic labeling of the union of stars
Let G be a graph of order p and size q. An (a, d)-edge-antimagic total labeling of G is a one-to-one map f taking the vertices and edges onto 1, 2, . . . , p + q so that the edge-weights w(u, v) = f(u) + f(v) + f(uv), uv ∈ E(G), form an arithmetic progression, starting from a and having common difference d. Moreover, such a labeling is called super (a, d)edge-antimagic total if f(V (G)) = {1, 2...
متن کاملNew Construction on Edge-Antimagic Labeling
An edge magic total labeling of a graph with p vertices and q edges is a bijection from the set of vertices and edges to 1, 2, . . . , p+ q such that for every edge the sums of the label of the edge and the label of its two end vertices are constant. Otherwise if the sum is distinct, it is said to be an edge-antimagic total labeling. A graph is called edgeantimagic if it admits edge-antimagic t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Malaya Journal of Matematik
سال: 2021
ISSN: 2319-3786,2321-5666
DOI: 10.26637/mjm0901/0103